
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1733. -- [Usaco2005 feb]Secret Milking Machine -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1733: [Usaco2005 feb]Secret Milking Machine</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>54&nbsp;&nbsp;<span class=green>Solved: </span>39<br>[<a href='submitpage.php?id=1733'>Submit</a>][<a href='problemstatus.php?id=1733'>Status</a>][<a href='bbs.php?id=1733'>Discuss</a>]</center><h2>Description</h2><div class=content>
Farmer John is constructing a new milking machine and wishes to
keep it secret as long as possible. He has hidden in it deep within
his farm and needs to be able to get to the machine without being
detected.  He must make a total of T (1 <= T <= 200) trips to the
machine during its construction. He has a secret tunnel that he
uses only for the return trips.

The farm comprises N (2 <= N <= 200) landmarks (numbered 1..N)
connected by P (1 <= P <= 40,000) bidirectional trails (numbered
1..P) and with a positive length that does not exceed 1,000,000.
Multiple trails might join a pair of landmarks.

To minimize his chances of detection, FJ knows he cannot use any
trail on the farm more than once and that he should try to use the
shortest trails.

Help FJ get from the barn (landmark 1) to the secret milking machine
(landmark N) a total of T times.  Find the minimum possible length
of the longest single trail that he will have to use, subject to the
constraint that he use no trail more than once. (Note well: The goal
is to minimize the length of the longest trail, not the sum of the
trail lengths.)

It is guaranteed that FJ can make all T trips without reusing a trail.

</div><h2>Input</h2><div class=content>
* Line 1: Three space-separated integers: N, P, and T

* Lines 2..P+1: Line i+1 contains three space-separated integers, A_i,
        B_i, and L_i, indicating that a trail connects landmark A_i to
        landmark B_i with length L_i.

</div><h2>Output</h2><div class=content>
* Line 1: A single integer that is the minimum possible length of the
        longest segment of Farmer John's route.

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata><br />
7 9 2<br />
1 2 2<br />
2 3 5<br />
3 7 5<br />
1 4 1<br />
4 3 1<br />
4 5 7<br />
5 7 1<br />
1 6 3<br />
6 7 3<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata><br />
5<br />
<br />
OUTPUT DETAILS:<br />
<br />
Farmer John can travel trails 1 - 2 - 3 - 7 and 1 - 6 - 7.  None of<br />
the trails travelled exceeds 5 units in length.  It is impossible<br />
for Farmer John to travel from 1 to 7 twice without using at least<br />
one trail of length 5.</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Gold'>Gold</a></p></div><center>[<a href='submitpage.php?id=1733'>Submit</a>][<a href='problemstatus.php?id=1733'>Status</a>][<a href='bbs.php?id=1733'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
